breadth_first_search

Locates the next node in graph to get to a position

T[T] breadth_first_search(Graph graph, T start)
T[T] breadth_first_search(Graph graph, T start, T goal)
void breadth_first_search(Graph graph, T start, T goal, out T[T] came_from, out U[T] distance)
deprecated("Killing")
void
breadth_first_search
(
T
U
)
(
Graph graph
,
T start
,
T goal
,
out T[T] came_from
,
out U[T] distance
)

Parameters

graph: Type: Graph
The graph of nodes
start: Type: T
Starting position to go to
goal: Type: T
The end position
came_from: Type: T[T]
Output: An AA mapping a position to another to get to a point
distance: Type: U[T]
Output: Distance of a node to the end point

See Also

http://www.redblobgames.com/pathfinding/tower-defense/

Meta

Source

See Implementation

devisualization util algorithms pathfinding breadthfirst functions

breadth_first_search